翻訳と辞書 Words near each other ・ Min-conflicts algorithm ・ Min-hee ・ Min-ho ・ Min-hyuk ・ Min-jae ・ Min-ji ・ Min-ju ・ Min-jun ・ Min-jung (name) ・ Min-ki ・ Min-Kush ・ Min-Kush Valley ・ Min-kyu ・ Min-kyung ・ Min-Liang Tan ・ Min-max heap ・ Min-max theorem ・ Min-plus matrix multiplication ・ Min-seo ・ Min-seok ・ Min-Sheng General Hospital ・ Min-soo ・ Min-sun ・ Min-woo ・ Min-young ・ Min/max kd-tree ・ Mina ・ Mina (1964 album) ・ Mina (1971 album) ・ Mina (drum) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Min-max heap ： ウィキペディア英語版 Min-max heap In computer science, a min-max heap is a double-ended priority queue implemented as a modified version of a binary heap. Like a binary heap, a min-max heap is represented as a complete binary tree. Unlike a binary heap, though, the nodes in this tree do not obey the min-heap property; rather they obey the min-max heap property: each node at an even level in the tree is less than all of its descendants, while each node at an odd level in the tree is greater than all of its descendants. Like binary heaps, min-max heaps support O(lg n) insertion and deletion, can be built in time O(n), and are often represented implicitly in an array. Operations like findmin() and findmax() take constant time. == Min-Max Heap Concepts == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Min-max heap」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.